Modeling the Position Information Inaccuracy in MANET Position-Based Routing Protocols

Abstract: This study aims to model the position information inaccuracy in position-based MANET routing protocol. The modeling aids on understanding the position information inaccuracy and assists the researchers to find suitable techniques and mechanisms to overcome the observed problems and improve the performance of the position-based routing protocols. Position-based routing protocols have become more popular in Mobile Ad hoc network (MANET) due to their advantages in using geographical position information of the nodes to route the data packets to the destination. Each node periodically sends its geographical position information to its neighbours using beacon packets. Nodes which receive the geographical position information of their neighbours store this information in their neighbours list. The data packet routing in position-based routing protocols uses neighbours' position information, which is stored in the node's neighbours list,and the destination's position information stored in the routing data packet header field to route the data packet from source to destination. Most of the current work in position-based routing protocols assumes that the position information in the node's neighbours list is accurate, while in reality, only a rough estimate of this position information is available for the nodes. Position information inaccuracy has a severe impact on degrading the performance of the position-based routing protocols in terms of average end-to-end delay, non-optimal route, false local maximum, and the routing loop

Dynamic routing discovery scheme for high mobility in mobile ad hoc wireless networks

An innovative technology that is widely used in many applications is the Mobile Ad-hoc Network (MANET). Discovery and maintenance of routes at MANET are important issues. Within MANET, broadcasting is used to discover a path within on-demand routing protocols. Establishing and maintaining a route periodically among the nodes is the challenge that requires the transmitting of control packets across a network. This state leads to the issue of broadcasting storms. Broadcasting control packets increase control packets overhead and decrease network performance. In this paper, we proposed a scheme called AODV-Velocity and Dynamic (AODV-VD) for effective broadcast control packets. The routing protocol for the ad-hoc on-demand distance victor (AODV) is used to implement the proposed AODV-VD scheme. AODV-VD scheme reduces both the excessive route discovery control packets and network overhead. Network simulator version 2.35 (NS2.35) was used to compare the proposed AODV-VD scheme to the AODV routing protocol in terms of end-to-end latency, average throughput, packet transmission ratio and overhead ratio

Prediction Model for Offloading in Vehicular Wi-Fi Network

It cannot be denied that, the inescapable diffusion of smartphones, tablets and other vehicular network applications with diverse networking and multimedia capabilities, and the associated blooming of all kinds of data-hungry multimedia services that passengers normally used while traveling exert a big challenge to cellular infrastructure operators. Wireless fidelity (Wi-Fi) as well as fourth generation long term evolution advanced (4G LTE-A) network are widely available today, Wi-Fi could be used by the vehicle users to relieve 4G LTE-A networks. Though, using IEE802.11 Wi-Fi AP to offload 4G LTE-A network for moving vehicle is a challenging task since it only covers short distance and not well deployed to cover all the roads. Several studies have proposed the offloading techniques based on predicted available APs for making offload decision. However, most of the proposed prediction mechanisms are only based on historical connection pattern. This work proposed a prediction model which utilized historical connection pattern, vehicular movement and driver profile to predict the next available AP.  The proposed model is compared with the existing models to evaluate its practicability

Defense in Depth: Multilayer of security

Many types and methodologies of attacks have been developed in order to target the victims in different ways affecting its resources and assets. This paper reviews the defense in depth concept that has been developed in which multilayer of security controls are implemented to protect resources and assets from such attackers through consuming all the resources and capabilities of the attacker before malicious activities affect such targeted resources and assets

Novel Method of Improving Quality of Service for Voice over Internet Protocol Traffic in Mobile Ad Hoc Networks

In recent years, the application of Mobile Ad-hoc Network (MANET) with Voice over Internet Protocol (VoIP) has been increased.  However, the level of Quality of Service (QoS) for VoIP traffic in MANET, while there is no infrastructure, will reduce when dealing with a large number of calls. In this type of dynamic environment, the developing of a new infrastructure becomes more costly and time-consuming. In this paper, we proposed an efficient method, called the Quality of Service-Nearest Neighbor (QoS-NN), to improve the QoS level for VoIP in order to manage the huge number of calls over MANET network. We utilized the Ad-hoc On-demand Distance Vector (AODV) protocol as the underlying routing protocol to implement our proposed method. We evaluated the proposed QoS-NN method using Network Simulator version 2 (NS2). The performance of the proposed QoS-NN method was compared with Lexicographic order method. The comparison was evaluated in terms of R-factor, end-to-end delay, packet loss ratio, and packet delivery ratio performance metrics. In addition, the proposed method evaluated under different network parameters such as VoIP CODECs, node mobility speed, number of calls and number of nodes. The comparison results indicate that the proposed QoS-NN outperform the Lexicographic order method

The Impact of selfishness Attack on Mobile Ad Hoc Network

Mobile Ad-Hoc Network (MANET) is an infrastructure-less network that has the ability to configure itself without any centralized management. The topology of MANET changes dynamically which makes it open for new nodes to join it easily. The openness area of MANET makes it very vulnerable to different types of attacks. One of the most dangerous attacks is selfishness attack. In this type of attack, each node tries to save its resources, behave selfishly or non-cooperatively by not forwarding packets that are generated by other nodes. Routing in MANET is susceptible to selfishness attack and this is a crucial issue which deserves to be studied and solved. Therefore, the main objective of this paper is to study the impact of selfishness attack on two routing protocols namely, Ad hoc On-Demand Distance Vector (AODV) and Destination Sequenced Distance Vector (DSDV), as a try to find the most resistant routing protocol to such attack. The contribution of this paper is a new Selfishness Attack Model (SAM) which applies selfishness attack on the two chosen routing protocols in the NS-2 simulator. According to the conducted simulation results, AODV shows higher performance than DSDV under the effect of selfishness attack

The resistance of routing protocols against DDOS attack in MANET

A Mobil Ad hoc Network (MANET) is a wireless multi-hop network with various mobile, self-organized and wireless infrastructure nodes. MANET characteristics such as openness restricted resources and decentralization impact node efficiency and made them easy to be affected by various security attacks, especially Distributed Denial of Service (DDoS) attacks. The goal of this research is to implement a simulation model called DDoS Attack Simulation Model (DDoSM) in Network Simulator 2(NS-2) and to examine the effect of DDoS Attack on various routing protocol types in MANET namely: Zone Routing Protocol (ZRP), Ad hoc On-Demand Distance Vector (AODV) protocol and Location-Aided Routing (LAR) protocol. The introduced model uses the NS-2 simulator to apply DDoS on the three chosen routing protocols. In terms of throughput and end-to-end latency under the consequences of the attack, the performance of three routings protocols was analyzed

A Computationally Efficient Online/Offline Signature Scheme for Underwater Wireless Sensor Networks

Underwater wireless sensor networks (UWSNs) have emerged as the most widely used wireless network infrastructure in many applications. Sensing nodes are frequently deployed in hostile aquatic environments in order to collect data on resources that are severely limited in terms of transmission time and bandwidth. Since underwater information is very sensitive and unique, the authentication of users is very important to access the data and information. UWSNs have unique communication and computation needs that are not met by the existing digital signature techniques. As a result, a lightweight signature scheme is required to meet the communication and computa‑ tion requirements. In this research, we present a Certificateless Online/Offline Signature (COOS) mechanism for UWSNs. The proposed scheme is based on the concept of a hyperelliptic curves cryptosystem, which offers the same degree of security as RSA, bilinear pairing, and elliptic curve cryptosystems (ECC) but with a smaller key size. In addition, the proposed scheme was proven secure in the random oracle model under the hyperelliptic curve discrete logarithm problem. A se‑ curity analysis was also carried out, as well as comparisons with appropriate current online/offline signature schemes. The comparison demonstrated that the proposed scheme is superior to the exist‑ ing schemes in terms of both security and efficiency. Additionally, we also employed the fuzzy‑based Evaluation‑based Distance from Average Solutions (EDAS) technique to demonstrate the effective‑ ness of the proposed scheme.publishedVersio

HARD HANDOVER OPTIMIZATION USING TIME WINDOW BASED HANDOVER ALGORITHM

ABSTRACT This paper shows and solves a handover problem occurring with current power control mechanisms in cochannel Wideband Code Division Multiple Access (WCDMA) heterogeneous networks. The problem is the mismatch between the required uplink transmits power when a user is communicating to a small cell and an underlying microcellular base-station. This paper introduces Time Window Handover (TWHO) algorithm to adapt the transmit power of the small cell users during the handover regime to prevent such Signal to Interference plus Noise Ratio (SINR) drops